A General Construction of Integer Codes Correcting Specific Errors in Binary Communication Channels

نویسندگان

چکیده

Integer codes have been successfully applied to various areas of communication and computer technology. They demonstrate good performance in correcting specific kinds errors. In many cases, the used integer are constructed by search. This paper presents an algebraic construction over ring integers modulo A=2n+1 capable at least up two bit errors a single b-byte. Moreover, can correct some configurations three or more erroneous bits, but not all possible ones. The is based on use cyclotomic cosets 2 A.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Correcting Codes for Satellite Communication Channels

This paper addresses the problem of efficient forward error correction on differentially encoded, quadriphase-shift-keying (DQPSK) channels. The approach is to design codes to correct the most probable error patterns. First the probability distribution of error patterns is derived. Then a class of convolutional codes that correct any single two-bit error is described. Finally a threshold decoda...

متن کامل

The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes

Nhtsl kninvn clwwes of binory Crror.corrcctirlg cocks h:lvc Iwcn dcsiyrcd for usc on symnwtric ch:innels, i.e.. chonnels for which the error prob;lbilitit’s I ~ O snd O -+ I are cqu:il. IIowcvcr. in ccrlvin applications (e.g.. LSI memory protection (l{cf. I). optic:lt c~)lllttttltlic:llit>n (Ref. 6)). tlw observed errors :Irc highly :Isynlnwtric. and the uppropriistc ch:lntwl model moy in f:wl ...

متن کامل

Gallager error-correcting codes for binary asymmetric channels

Abstract. We derive critical noise levels for Gallager codes on asymmetric channels as a function of the input bias and the temperature. Using a statistical mechanics approach we study the space of codewords and the entropy in the various decoding regimes. We further discuss the relation of the convergence of the message passing algorithm with the endogenous property and complexity, characteriz...

متن کامل

Codes Correcting Repeated Burst Errors Blockwise

This paper obtains bounds for linear codes which are capable to correct the errors blockwise which occur during the process of transmission. The kind of errors considered are known as repeated burst errors of length b(fixed), introduced by Dass and Garg (2009). An illustration for such kind of codes has also been provided. Mathematics Subject Classification: 94B20, 94B25, 94B65

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11112521